Bounds for spherical codes
نویسندگان
چکیده
A set C of unit vectors in R is called an L-spherical code if x ·y ∈ L for any distinct x, y in C. Spherical codes have been extensively studied since their introduction in the 1970’s by Delsarte, Goethals and Seidel. In this note we prove a conjecture of Bukh on the maximum size of spherical codes. In particular, we show that for any set of k fixed angles, one can choose at most O(d) lines in R such that any pair of them forms one of these angles.
منابع مشابه
Codes in spherical caps
We consider bounds on codes in spherical caps and related problems in geometry and coding theory. An extension of the Delsarte method is presented that relates upper bounds on the size of spherical codes to upper bounds on codes in caps. Several new upper bounds on codes in caps are derived. Applications of these bounds to estimates of the kissing numbers and one-sided kissing numbers are consi...
متن کاملar X iv : m at h / 06 06 73 4 v 1 [ m at h . M G ] 2 8 Ju n 20 06 CODES IN SPHERICAL CAPS
We consider bounds on codes in spherical caps and related problems in geometry and coding theory. An extension of the Delsarte method is presented that relates upper bounds on the size of spherical codes to upper bounds on codes in caps. Several new upper bounds on codes in caps are derived. Applications of these bounds to estimates of the kissing numbers and one-sided kissing numbers are consi...
متن کاملLinear Programming Bounds for Spherical Codes and Designs
We describe linear programming (LP) techniques used for obtaining upper/lower bounds on the size of spherical codes/spherical designs. A survey of universal bounds is presented together with description of necessary and sufficient conditions for their optimality. If improvements are possible, we describe methods for finding new bounds. In both cases we are able to find new bounds in great range...
متن کاملOn Linear Programming Bounds for Spherical Codes and Designs
We investigate universal bounds on spherical codes and spherical designs that could be obtained using Delsarte’s linear programming methods. We give a lower estimate for the LP upper bound on codes, and an upper estimate for the LP lower bound on designs. Specifically, when the distance of the code is fixed and the dimension goes to infinity, the LP upper bound on codes is at least as large as ...
متن کاملImproved Delsarte bounds for spherical codes in small dimensions
We present an extension of the Delsarte linear programming method for spherical codes. For several dimensions it yields improved upper bounds including some new bounds on kissing numbers. Musin’s recent work on kissing numbers in dimensions three and four can be formulated in our framework.
متن کاملImproved Delsarte Bounds via Extension of the Function Space
A spherical (n,N, α)-code is a set {x1, . . . ,xN} of unit vectors in R such that the pairwise angular distance betweeen the vectors is at least α. One tries to find codes which maximize N or α if the other two values are fixed. The kissing number problem asks for the maximum number k(n) of nonoverlapping unit balls touching a central unit ball in n-space. This corresponds to the special case o...
متن کامل